Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs
نویسندگان
چکیده
In this paper, we show that any B2-VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into O(logn) outerstring graphs or O(log n) permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on B2-VPG graphs.
منابع مشابه
1-String B_2-VPG Representation of Planar Graphs
In this paper, we prove that every planar graph has a 1-string B2-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
متن کاملString graphs of k-bend paths on a grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. If the number k of bends is not restricted, then the VPG graphs are shown to be equivalent to the well-known class of string graphs, namely, the in...
متن کاملApproximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs
A graph G is called Bk-VPG (resp., Bk-EPG), for some constant k ≥ 0, if it has a string representation on a grid such that each vertex is an orthogonal path with at most k bends and two vertices are adjacent in G if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a Bk-VPG graph intersect exactly once, th...
متن کاملVertex Intersection Graphs of Paths on a Grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. In chip manufacturing, circuit layout is modeled as paths (wires) on a grid, where it is natural to constrain the number of bends per wire for reas...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017